Constructive Solid Geometry for Triangulated Polyhedra Constructive Solid Geometry for Triangulated Polyhedra

Triangulated polyhedra are simpler to process than arbitrary polyhedra for many graphics operations. Algorithms that compute the boundary representation of a constructive solid geometry (csg) model, however, may perform poorly if the model involves triangulated polyhedral primitives. A new csg algorithm speciically tailored to triangulated primitives is presented. The key features of this algorithm are its global processing of intersections between polyhedra and its avoidance of ray-casting when classifying polyhedra against one another. The new algorithm is shown to perform substantially better than one published algorithm, and arguments are presented suggesting its beneets over several others in the context of an interactive modeling environment.